首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   14篇
  免费   1篇
  2016年   1篇
  2015年   2篇
  2013年   2篇
  2012年   2篇
  2010年   3篇
  2009年   1篇
  2004年   2篇
  2003年   1篇
  1999年   1篇
排序方式: 共有15条查询结果,搜索用时 78 毫秒
1.
研究了生物柴油和矿物柴油对柴油机油高温清净性的影响。在柴油机油中分别加入不同比例的生物柴油和矿物柴油,通过热管氧化试验对高温清净性进行评定。结果表明,生物柴油自身较易氧化,加速了柴油机油的氧化变质,使柴油机油清净性变差;不同质量等级柴油机油高温清净性受生物柴油影响的程度不同,不同原料制备的生物柴油对柴油机油高温清净性影响也不同。  相似文献   
2.
实验合成了一种磺酸基功能化离子液体,并用于催化高酸值餐饮废油制备生物柴油。当醇油物质的量之比为8∶1,离子液体用量为废油质量的0.8%,反应温度为150℃,反应时间为180min,生物柴油的产率可达到90.6%。该离子液体可以在比较温和的条件下将餐饮废油的酸值从13.22mgKOH/g降低到1mgKOH/g以下,然后利用NaOH催化生产生物柴油,会达到更高的产率,更为经济可行。  相似文献   
3.
资产维修是社会持续发展的重要技术途径,同时,维修又要消耗资源产生废弃物,对环境造成危害。汽车维修是最庞大的维修行业。以某运输团军用汽车年维修产生的废弃物的统计分析为基础,论述了推行绿色维修的重要性和紧迫性,并针对目前的维修废弃物处理方式及其危害性,从管理及回收处置方面提出了相应的改进意见。  相似文献   
4.
通过对不同化学实验产生的废液的分析研究,提出了一些简单易行的化学实验废液的处理方法,便于学生实际操作,可减少对环境的污染,有助提高学生的环保意识。  相似文献   
5.
萃取-絮凝组合精制再生废润滑油   总被引:3,自引:0,他引:3  
根据溶剂精制再生废润滑油环保、经济、高效的特点,采用单因素实验方法,应用极性溶剂为萃取剂、乙二胺为絮凝剂,组合精制再生废润滑油。最佳工艺条件为:萃取剂为正丁醇,精制时间为15 min,精制温度为25℃,剂/油质量比为5∶1,絮凝剂添加比例为1.0%。以该精制工艺操作,再生油性能指标得到明显改善,黏温指数达130以上,闪点达200℃,酸值为0.05 mg.g-1,灰分质量分数降低到0.01%以下,金属元素含量显著下降,再生油产率为80.6%,各项性能基本上符合HVI150基础油指标,表明该精制工艺再生废润滑油可行,应用前景广阔。  相似文献   
6.
7.
废旧轮胎作为新型柔性拦石墙结构的重要组成部分,研究其组成材料及抗冲击性能具有重要意义。采用ANSYS/LS-DYNA软件,以子午线轮胎175/70R14为基础,建立了废旧轮胎和刚性拦石墙上添加废旧轮胎前后的有限元模型,分别考察了2种情况下刚性拦石墙所受落石冲击力的大小,研究了废旧轮胎各部分材料的耗能特点。数值分析表明:废旧轮胎吸能作用明显,能够有效地减缓落石对刚性拦石墙的冲击,并显著提高新型柔性拦石墙的防护能力。  相似文献   
8.
为更好地将废旧轮胎应用于落石灾害防护领域,对不同型号的废旧轮胎进行了单向重复压缩试验,并对单个轮胎分别进行了2个相互垂直方向上的重复压缩试验,利用LS-DYNA软件模拟了废旧轮胎的压缩试验过程。结果表明:废旧轮胎具有明显的弹性特征和被重复利用的性质,能够重复承受较大变形且割线刚度降低较小;一个方向上被压缩过的废旧轮胎沿圆周方向旋转90°后再进行压缩,其割线刚度几乎能够恢复到初始状态;废旧轮胎的有限元简化模型较为合理,在落石灾害防护领域有着广阔的应用前景。  相似文献   
9.
We consider an expansion planning problem for Waste‐to‐Energy (WtE) systems facing uncertainty in future waste supplies. The WtE expansion plans are regarded as strategic, long term decisions, while the waste distribution and treatment are medium to short term operational decisions which can adapt to the actual waste collected. We propose a prediction set uncertainty model which integrates a set of waste generation forecasts and is constructed based on user‐specified levels of forecasting errors. Next, we use the prediction sets for WtE expansion scenario analysis. More specifically, for a given WtE expansion plan, the guaranteed net present value (NPV) is evaluated by computing an extreme value forecast trajectory of future waste generation from the prediction set that minimizes the maximum NPV of the WtE project. This problem is essentially a multiple stage min‐max dynamic optimization problem. By exploiting the structure of the WtE problem, we show this is equivalent to a simpler min‐max optimization problem, which can be further transformed into a single mixed‐integer linear program. Furthermore, we extend the model to optimize the guaranteed NPV by searching over the set of all feasible expansion scenarios, and show that this can be solved by an exact cutting plane approach. We also propose a heuristic based on a constant proportion distribution rule for the WtE expansion optimization model, which reduces the problem into a moderate size mixed‐integer program. Finally, our computational studies demonstrate that our proposed expansion model solutions are very stable and competitive in performance compared to scenario tree approaches. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 47–70, 2016  相似文献   
10.
A national recycling and waste management company provides periodic services to its customers from over 160 service centers. The services are performed periodically in units of weeks over a planning horizon. The number of truck‐hours allocated to this effort is determined by the maximum weekly workload during the planning horizon. Therefore, minimizing the maximum weekly workload results in minimum operating expenses. The perfectly periodic service scheduling (PPSS) problem is defined based on the practices of the company. It is shown that the PPSS problem is strongly NP‐hard. Attempts to solve large instances by using an integer programming formulation are unsuccessful. Therefore, greedy BestFit heuristics with three different sorting schemes are designed and tested for six real‐world PPSS instances and 80 randomly generated data files. The heuristics provide effective solutions that are within 2% of optimality on average. When the best found BestFit schedules are compared with the existing schedules, it is shown that operational costs are reduced by 18% on average. © 2012 Wiley Periodicals, Inc. Naval Research Logistics 59: 160–171, 2012  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号